Programming Research Group Developing Fairness in Terminating and Reactive Programs Developing Fairness in Terminating and Reactive Programs
نویسنده
چکیده
This paper presents a theory of fairness within the framework of Dijkstra's weakest preconditions and Back's action systems. It is general enough to deal with all kinds of fairness, not just strong and weak fairness. A deenition of fairness and reenement to deal with non-terminating programs is also obtained. For terminating and non-terminating programs with and without fairness, theorems about program development such as monotonicity are derived and illustrated by means of examples, principally the readers-writers problem.
منابع مشابه
Non-Terminating Processes in the Situation Calculus
By their very design, many robot control programs are non-terminating. To give a simple example one we shall use in this paper an office coffee-delivery robot might be implemented as an infinite loop in which the robot responds to exogenous requests for coffee that are maintained on a queue. Since a future coffee request is always possible, the program never terminates. As is the case for more ...
متن کاملModularity of Termination of TRS under Fair Strategies
We define a new notion of fairness for term rewriting system (TRS). We prove the modularity of termination of TRS under such fair strategies, that is, two TRS terminate under fair strategies if and only if their disjoint union terminates under fair strategies. In order to do so, we demonstrate that termination under fair strategies of a TRS is equivalent to the TRS being weakly terminating and ...
متن کاملOn Confluence of Non-terminating CHR Programs
Confluence is an important property for any kind of rewrite system including CHR, which is a general-purpose declarative committedchoice language consisting of multi-headed guarded rules. CHR can yield a confluence problem, because of non-determinism in the choice of rules using the abstract semantics. Confluence in CHR is an ongoing research topic, because it provides numerous benefits for imp...
متن کاملSynthesizing Executable Programs
Automatic generation of correct software from requirements has long been a “holy grail” for system and software development. According to this vision, instead of implementing a system and then working hard to apply testing and verification methods to prove system correctness, a system is rather built correctly by construction. This problem, referred to as synthesis, is undecidable in the genera...
متن کاملM O N a D I C R O B O T I C S Monadic Robotics
We have developed a domain speci c language for the construction of robot controllers, Frob (Functional ROBotics). The semantic basis for Frob is Functional Reactive Programming, or simply FRP, a purely functional model of continuous time, interactive systems. FRP is built around two basic abstractions: behaviors, values de ned continuously in time, and events, discrete occurances in time. On t...
متن کامل